A representation of relatively complemented distributive lattices
نویسندگان
چکیده
منابع مشابه
Representations of Relatively Complemented Modular Lattices
Introduction. A module over a ring will be said to be locally projective if and only if every finitely generated submodule is projective. As will be shown (7.14), it readily follows from known facts that if M is a locally projective module over a regular ring R, then the set L(M, R) of all finitely generated submodules of M is a relatively complemented modular lattice. This paper is concerned w...
متن کاملA note on supermodular sublattices in finite relatively complemented lattices
A sublattice in a lattice is called supermodular if, for every two elements, one of which belongs to the sublattice, at least one of their meet and join also belongs to the sublattice. In this note, we describe supermodular sublattices in products of relatively complemented lattices.
متن کاملA Representation Theory for Modalized Distributive Lattices
By a lattice we shall always mean a distributive lattice which is bounded, i.e. has both a bottom element 0 and a top element 1. Lattice homomorphisms will always be assumed to preserve 0 and 1. By a modality on a (distributive) lattice L = (L, ∧, ∨, ≤, 0, 1) is meant a map : L → L satisfying (1) 1 = 1, (2) (x ∧ y) = x ∧ y for x, y ∈ L. The pair (L, ) will be called a modalized (distributive) l...
متن کاملOn the Representation of Finite Distributive Lattices
Classical results of Birkhoff and of Dilworth yield an extremely useful representation of a finite distributive lattice L as the downset lattice D(JL) of poset JL of join-irreducible elements of L. Through this they get a correspondence between the chain decompositions of JL and the tight embeddings of L into a product of chains. We use a simple but elegant result of Rival which characterizes s...
متن کاملRepresentation Theorem for Finite Distributive Lattices
1. INDUCTION IN A FINITE LATTICE Let L be a 1-sorted structure and let A, B be subsets of L. Let us observe that A⊆ B if and only if: (Def. 1) For every element x of L such that x ∈ A holds x ∈ B. Let L be a lattice. Observe that there exists a chain of L which is non empty. Let L be a lattice and let x, y be elements of L. Let us assume that x ≤ y. A non empty chain of L is called a x-chain of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1975
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-32-2-153-158